Stronger version of standard completeness theorem for MTL
نویسنده
چکیده
As it was shown in [7], Monoidal t-norm based logic (MTL) is a logic of left-continuous t-norms. In other words, this means that MTL enjoys the standard completeness theorem. In this paper we present a different proof of this theorem. In fact, we prove even more since we show that MTL is complete w.r.t. the class of standard MTL-algebras with finite congruence lattices or equivalently with finitely many Archimedean classes.
منابع مشابه
ON COMPACTNESS AND G-COMPLETENESS IN FUZZY METRIC SPACES
In [Fuzzy Sets and Systems 27 (1988) 385-389], M. Grabiec in- troduced a notion of completeness for fuzzy metric spaces (in the sense of Kramosil and Michalek) that successfully used to obtain a fuzzy version of Ba- nachs contraction principle. According to the classical case, one can expect that a compact fuzzy metric space be complete in Grabiecs sense. We show here that this is not the case,...
متن کاملStandard completeness theorem for PiMTL
ΠMTL is a schematic extension of the monoidal t-norm based logic (MTL) by the characteristic axioms of product logic. In this paper we prove that ΠMTL satisfies the standard completeness theorem. From the algebraic point of view, we show that the class of ΠMTL-algebras (bounded commutative cancellative residuated l-monoids) in the real unit interval [0, 1] generates the variety of all ΠMTL-alge...
متن کاملA note on the structure of PiMTL-chains and left-continuous cancellative T-norms
Recently the question of standard completeness of MTL and its extensions were deeply studied. Jenei and Montagna showed that MTL logic satisfies standard completeness theorem (see [6]). In [2], the authors studied standard completeness of ΠMTL which is an axiomatic extension of MTL logic where the conjunction is interpreted by a left-continuous cancellative t-norm. They showed that ΠMTL logic i...
متن کاملOn the Expressiveness and Monitoring of Metric Temporal Logic
It is known that Metric Temporal Logic (MTL) is strictly less expressive than the Monadic First-Order Logic of Order and Metric (FO[<, +1]) when interpreted over timed words; this remains true even when the time domain is bounded a priori. In this work, we present an extension of MTL with the same expressive power as FO[<, +1] over bounded timed words (and also, trivially, over time-bounded sig...
متن کاملSuzuki-type fixed point theorems for generalized contractive mappings that characterize metric completeness
Inspired by the work of Suzuki in [T. Suzuki, A generalized Banach contraction principle that characterizes metric completeness, Proc. Amer. Math. Soc. 136 (2008), 1861--1869], we prove a fixed point theorem for contractive mappings that generalizes a theorem of Geraghty in [M.A. Geraghty, On contractive mappings, Proc. Amer. Math. Soc., 40 (1973), 604--608]an...
متن کامل